Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model
نویسندگان
چکیده
We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree > 4) is NP-complete, thus solving a long-standing open problem. On the positive side, we give an efficient algorithm for several restricted variants, such as graphs of bounded branch width and a subexponential exact algorithm for general plane graphs.
منابع مشابه
Higher-Degree Orthogonal Graph Drawing with Flexibility Constraints
Much work on orthogonal graph drawing has focused on 4-planar graphs, that is planar graphs where all vertices have maximum degree 4. In this work, we study aspects of the Kandinsky model, which is a model for orthogonal graph drawings of higher-degree graphs. First, we examine the decision problem β-Embeddability, which asks whether for a given planar graph with a fixed or variable embedding, ...
متن کاملOn Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and diagonal segments, respectively). For planar graphs of max-degree 4, we analyze relationships between the graph classes that can be drawn bendless in the two mo...
متن کاملSketch-Driven Orthogonal Graph Drawing
We present an orthogonal graph drawing algorithm that uses a sketchy drawing of the graph as input. While the algorithm produces an orthogonal drawing with few bends in the Kandinsky model it also preserves the general appearance of the sketch. Potential applications for this kind of drawing algorithm include the generation of schematic maps from geographic networks and interactive orthogonal g...
متن کاملSmooth Orthogonal Layouts
We study the problem of creating smooth orthogonal layouts for planar graphs. While in traditional orthogonal layouts every edge is made of a sequence of axis-aligned line segments, in smooth orthogonal layouts every edge is made of axis-aligned segments and circular arcs with common tangents. Our goal is to create such layouts with low edge complexity, measured by the number of line and circul...
متن کاملFuzzy Complexity Analysis with Conflict Resolution for Educational Projects
Evaluative and comparative analysis among educational projects remains an issue for administration, program directors, instructors, and educational institutes. This study reports a fuzzy complexity model for educational projects, which has two primary aspects (technical aspects and transparency aspects). These aspects may not be measured precisely due to uncertain situations. Therefore, a fuzzy...
متن کامل